Approximating Bounded Degree Instances of NP-Hard Problems
نویسنده
چکیده
We present some of the recent results on computational complexity of approximating bounded degree combinatorial optimization problems. In particular, we present the best up to now known explicit nonapproximability bounds on the very small degree optimization problems which are of particular importance on the intermediate stages of proving approximation hardness of some other generic optimization problems.
منابع مشابه
Complexity of approximating bounded variants of optimization problems
We study low degree graph problems such as Maximum Independent Set and Minimum Vertex Cover. The goal is to improve approximation lower bounds for them and for a number of related problems like Max-B-Set Packing, Min-B-Set Cover, and Max-B-Dimensional Matching, B ≥ 3. We prove, for example, that it is NP-hard to achieve an approximation factor of 95 94 for Max-3-DM, and a factor of 48 47 for Ma...
متن کاملApproximating dense cases of covering problems
We study dense instances of several covering problems An in stance of the set cover problem with m sets is dense if there is such that any element of the ground set X belongs to at least m sets We show that the dense set cover problem can be approximated with the performance ratio c log jX j for any c though it is unlikely to be NP hard A polynomial time approximation scheme is constructed for ...
متن کاملApproximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems
We study the complexity of approximate counting Constraint Satisfaction Problems (#CSPs) in a bounded degree setting. Specifically, given a Boolean constraint language Γ and a degree bound ∆, we study the complexity of #CSP∆(Γ), which is the problem of counting satisfying assignments to CSP instances with constraints from Γ and whose variables can appear at most ∆ times. Our main result shows t...
متن کاملThe Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract)
We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specified graphs, many of which are PSPACEcomplete. We present polynomial time approximation algorithms for several standard PSPACE-hard problems considered in the literature. In contrast, we prove that finding -approximations for any > 0, for several other problems when the instances are s...
متن کاملOn Approximability of Bounded Degree Instances of Selected Optimization Problems
In order to cope with the approximation hardness of an underlying optimization problem, it is advantageous to consider specific families of instances with properties that can be exploited to obtain efficient approximation algorithms for the restricted version of the problem with improved performance guarantees. In this thesis, we investigate the approximation complexity of selected NP-hard opti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 8 شماره
صفحات -
تاریخ انتشار 2001